On the expected longest length probe sequence for hashing with separate chaining
نویسندگان
چکیده
منابع مشابه
On the expected longest length probe sequence for hashing with separate chaining
Article history: Received 2 November 2010 Received in revised form 14 March 2011 Accepted 4 April 2011 Available online 15 April 2011
متن کاملThe Expected Length of the Longest Probe Sequence for Bucket Searching when the Distribution is Not Uniform
We study the expected value of the maximum number of accesses needed to locate an element in a hashing file constructed by using an order-preserving hashing function and with collision resolution by the method of separate chaining. It is assumed that X1 , . . ., X„ are independent [0, 1]-valued random variables with common density f, and that XI is hashed to the nX; + 1st bucket (chain). For al...
متن کاملExpected Length of the Longest Common Subsequence for Large Alphabets
We consider the length L of the longest common subsequence of two randomly uniformly and independently chosen n character words over a k-ary alphabet. Subadditivity arguments yield that E [L] /n converges to a constant γk. We prove a conjecture of Sankoff and Mainville from the early 80’s claiming that γk √ k → 2 as k → ∞.
متن کاملOn the Limiting Distribution for the Length of the Longest Alternating Sequence in a Random Permutation
Recently Richard Stanley initiated a study of the distribution of the length asn(w) of the longest alternating subsequence in a random permutation w from the symmetric group Sn. Among other things he found an explicit formula for the generating function (on n and k) for Pr (asn(w) ≤ k) and conjectured that the distribution, suitably centered and normalized, tended to a Gaussian with variance 8/...
متن کامل2 Dictionary/membership Problem 3 Hashing with Chaining
In dictionary/membership problem, we want to keep a set S of items with possibly some extra information associated with each one of them. (From now on, we denote the number of elements in S by n.) For the membership problem, the goal is to create a data structure that allows us to ask whether a given item x is in S or not. For a dictionary, the data structure should also return the infomation a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2011
ISSN: 1570-8667
DOI: 10.1016/j.jda.2011.04.005